Dining Cryptographers are Practical
نویسندگان
چکیده
The dining cryptographers protocol provides information-theoretically secure sender and recipient untraceability. However, the protocol is considered to be impractical because a malicious participant may disrupt the communication. We propose an implementation which provides information-theoretical security for senders and recipients, and in which a disruptor with limited computational capabilites can easily be detected.
منابع مشابه
Dining Cryptographers with 0.924 Verifiable Collision Resolution
The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately creating collisions. We propose a computationally secure dining cryptographers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and which ...
متن کاملThe Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability
appeared in: Proceedings of EUROCRYPT'89, LNCS, Springer-Verlag Heidelberg The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability Michael Waidner, Birgit Pfitzmann Universität Karlsruhe, Postfach 6980 D-7500 Karlsruhe 1, F. R. Germany
متن کاملParameterised Anonymity
We introduce the notion of parameterised anonymity, to formalize the anonymity property of protocols with an arbitrary number of participants. This definition is an extension of the well known CSP anonymity formalization of Schneider and Sidiropoulos [23]. Using recently developed invariant techniques for solving parameterised boolean equation systems, we then show that the Dining Cryptographer...
متن کاملDining Cryptographers’ Wiki
This paper introduces an implementation of a closed group distributed anonymous wiki based on a Dining Cryptographer (DC) network. We argue that such a wiki application particularly suits the properties of a DC network, e.g., performance is less important, and broadcast communication is needed by default.
متن کاملComparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
We analyse different versions of the dining cryptographers protocol by means of automatic verication via model checking. Specically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity requirements specied. Two different model checking techniques (ordered binary decision diagrams and SAT-based bounded model checking) are evalu...
متن کامل